- optimal [optimum] solution
- оптимальное решение
The English-Russian dictionary on reliability and quality control. 2015.
optimal [optimum] solution
Смотреть что такое "optimal [optimum] solution" в других словарях:
optimal — optimal, ale, aux [ ɔptimal, o ] adj. • 1906; de optimum, d apr. maximal ♦ Didact. Qui est un optimum; qui est le meilleur possible. ⇒ 1. idéal, parfait. Expérience faite dans des conditions optimales. ● optimal, optimale, optimaux adjectif (de… … Encyclopédie Universelle
Optimal design — This article is about the topic in the design of experiments. For the topic in optimal control theory, see shape optimization. Gustav Elfving developed the optimal design of experiments, and so minimized surveyors need for theodolite measurements … Wikipedia
The theory of a second-best solution — concerns the events that happen when a condition for an optimal outcome isn t met. In that case a second best solution should be sought. But the second best solution isn t always the one where every other condition is met except the one missing… … Wikipedia
Local optimum — is a term in applied mathematics and computer science.A local optimum of a combinatorial optimization problem is a solution optimal within a neighboring set of solutions. This is in contrast to a global optimum, which is the optimal solution… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
Suit combination — A suit combination, in the partnership card game contract bridge, is the combined holding in declarer s and dummy s hands of a specific suit. The term is also used for the order in which these cards should be played to achieve a specified goal,… … Wikipedia
Cutting-plane method — In mathematical optimization, the cutting plane method is an umbrella term for optimization methods which iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are popularly used to… … Wikipedia
Approximation algorithm — In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP hard problems; since it is unlikely that there … Wikipedia
Calculus of variations — is a field of mathematics that deals with extremizing functionals, as opposed to ordinary calculus which deals with functions. A functional is usually a mapping from a set of functions to the real numbers. Functionals are often formed as definite … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
